Mist&-e Annihilation Games*
نویسنده
چکیده
Graph games with an annihilation rule, as introduced by Conway, Fraenkel and Yesha, are studied under the midre play rule for progressively finite graphs that satisfy a condition on the reversibility of non-terminal Sprague-Grundy zeros to Spragu+Grundy ones. Two general theorems on the Spragu+Grundy zeros and ones are given, followed by two theorems characterizing the set of P-positions under certain additional conditions. Application is made to solving many subtraction games, and solutions to two games not covered by the general theory are presented indicating a direction for future research.
منابع مشابه
Local Annihilation Method and Some Stiff Problems
In this article, a new scheme inspired from collocation method is presented for numerical solution of stiff initial-value problems and Fredholm integral equations of the first kind based on the derivatives of residual function. Then, the error analysis of this method is investigated by presenting an error bound. Numerical comparisons indicate that the presented method yields accur...
متن کاملEdge 2-rainbow domination number and annihilation number in trees
A edge 2-rainbow dominating function (E2RDF) of a graph G is a function f from the edge set E(G) to the set of all subsets of the set {1,2} such that for any edge.......................
متن کاملThe Relationship Between Tendency to Computer Games and the Mental Health of Junior High School Students of Shahr-e Kord, Iran
Background and aims: Given that computer games have positive and negative functions and mayaffect the mental health of individuals, the present research aimed to study the relationship betweenthe tendency to playing computer games and the mental health of junior high school students inShahr-e Kord.Methods: The current cross-sectional descriptive-analytical study was cond...
متن کاملInternal-Evolution Driven Growth in Creation-Annihilation Cyclic Games
In this paper, the domain growth process in a novel kind of cyclic game is investigated by similation method. Different with the classical cyclic games, this process is called ”creation-annihilation process”, in which is just like the autocatalysis system. The results of numerical simulations show that the domain growth in such cyclic games with four or five states has a special feature: the gr...
متن کاملError Correcting Codes and Combinatorial Games
The \losing positions" of certain combinatorial games constitute linear error detecting and correcting codes. We show that annihilation games provide a potentially polynomial method for computing codes (anncodes). We also give a short proof of the basic properties of the previously known lexicodes, which are deened by means of an exponential algorithm, and are related to game theory. In the nal...
متن کامل